Friendship decompositions of graphs
نویسنده
چکیده
We investigate the maximum number of elements in an optimal t-friendship decomposition of graphs of order n. Asymptotic results will be obtained for all fixed t ≥ 4 and for t = 2, 3 exact results will be derived.
منابع مشابه
SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.
متن کاملFriendship Two-Graphs
A friendship graph is a graph in which every two distinct vertices have exactly one common neighbor. All finite friendship graphs are known, each of them consists of triangles having a common vertex. We extend friendship graphs to two-graphs, a two-graph being an ordered pair G = (G0, G1) of edge-disjoint graphs G0 and G1 on the same vertex-set V (G0) = V (G1). One may think that the edges of G...
متن کاملThe Königsberg Bridge Problem and the Friendship Theorem
This development provides a formalization of undirected graphs and simple graphs, which are based on Benedikt Nordhoff and Peter Lammich’s simple formalization of labelled directed graphs [4] in the archive. Then, with our formalization of graphs, we have shown both necessary and sufficient conditions for Eulerian trails and circuits [2] as well as the fact that the Königsberg Bridge problem do...
متن کاملSimplicial Decompositions, Tree-decompositions and Graph Minors
The concepts of simplicial decompositions, tree-decompositions and simplicial tree-decompositions were all inspired by a common forerunner: the decompositions of finite graphs used by K. Wagner in his classic paper [ 13 ], in which he proved the equivalence of the 4-Colour-Conjecture to Hadwiger’s Conjecture for n = 5. To show that the 4CC implies Hadwiger’s Conjecture (for n = 5), Wagner used ...
متن کاملA Note on the Pancyclism of Block Intersection Graphs of Universal-Friend Friendship Hypergraphs
In this note, we consider the i-block intersection graphs (i-BIG) of a universal-friend friendship 3-hypergraph and show that they are pancyclic for i = 1, 2. We also show that the 1-BIG of a universalfriend friendship 3-hypergraph is Hamiltonian-connected.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008